Solving the Aircraft Landing Problem with time discretization approach

This paper studies the multiple runway aircraft landing problem. The aim is to schedule arriving aircraft to available runways at the airport. Landing times lie within predefined time windows and safety separation constraints between two successive landings must be satisfied. We propose a new approach for solving the problem. The method is based on an approximation of the separation time matrix and on time discretization. It provides lower bound or upper bound depending on the choice of the approximating matrix. These bounds are used in a cut algorithm to, exactly or heuristically, solve the problem. Computational tests, performed on publicly available problems involving up to 500 aircraft, show the efficiency of the approach.